The Limit in the Mean Field Bipartite Travelling Salesman Problem
نویسنده
چکیده
The edges of the complete bipartite graph Kn,n are assigned independent lengths from uniform distribution on the interval [0, 1]. Let Ln be the length of the minimum travelling salesman tour. We prove that as n tends to infinity, Ln converges in probability to a certain number, approximately 4.0831. This number is characterized as the area of the region x, y ≥ 0, (1 + x/2) · e + (1 + y/2) · e ≥ 1 in the x-y-plane.
منابع مشابه
A CONSTRAINED SOLID TSP IN FUZZY ENVIRONMENT: TWO HEURISTIC APPROACHES
A solid travelling salesman problem (STSP) is a travelling salesman problem (TSP) where the salesman visits all the cities only once in his tour using dierent conveyances to travel from one city to another. Costs and environmental eect factors for travelling between the cities using dierent conveyances are dierent. Goal of the problem is to nd a complete tour with minimum cost that damages the ...
متن کاملA New Hybrid Parallel Simulated Annealing Algorithm for Travelling Salesman Problem with Multiple Transporters
In today’s competitive transportation systems, passengers search to find traveling agencies that are able to serve them efficiently considering both traveling time and transportation costs. In this paper, we present a new model for the traveling salesman problem with multiple transporters (TSPMT). In the proposed model, which is more applicable than the traditional versions, each city has diffe...
متن کاملA hybrid metaheuristic using fuzzy greedy search operator for combinatorial optimization with specific reference to the travelling salesman problem
We describe a hybrid meta-heuristic algorithm for combinatorial optimization problems with a specific reference to the travelling salesman problem (TSP). The method is a combination of a genetic algorithm (GA) and greedy randomized adaptive search procedure (GRASP). A new adaptive fuzzy a greedy search operator is developed for this hybrid method. Computational experiments using a wide range of...
متن کاملThe travelling salesman problem in the stochastic mean field model
In the stochastic mean field model of distance, the edges of the complete graph on n vertices are assigned independent identically distributed random lengths. We take these lengths from uniform distribution on the interval [0, 1] and let Ln denote the minimum length of a travelling salesman tour. It has been conjectured since the mid-1980’s that Ln converges in probability to a certain number, ...
متن کاملA modified elite ACO based avoiding premature convergence for travelling salesmen problem
The Travelling Salesmen Problem (TSP) is one of the most important and famous combinational optimization problems that aim to find the shortest tour. In this problem, the salesman starts to move from an arbitrary place called depot and after visiting all nodes, finally comes back to depot. Solving this problem seems hard because program statement is simple and leads this problem belonging to NP...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006